翻訳と辞書 Words near each other ・ Degreasing ・ Degredado ・ Degree ・ Degree (angle) ・ Degree (graph theory) ・ Degree (music) ・ Degree (temperature) ・ Degree Angular Scale Interferometer ・ Degree Colleges in Kashmir ・ Degree completion program ・ Degree Confluence Project ・ Degree day ・ Degree diameter problem ・ Degree distribution ・ Degree Lintner ・ Degree matrix ・ Degree of a continuous mapping ・ Degree of a field extension ・ Degree of a polynomial ・ Degree of an algebraic variety ・ Degree of anonymity ・ Degree of coherence ・ Degree of curvature ・ Degree of frost ・ Degree of Honor Protective Association ・ Degree of ionization ・ Degree of isochronous distortion ・ Degree of parallelism ・ Degree of Pocahontas ・ Degree of polarization Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Degree matrix ： ウィキペディア英語版 Degree matrix In the mathematical field of graph theory the degree matrix is a diagonal matrix which contains information about the degree of each vertex—that is, the number of edges attached to each vertex.〔.〕 It is used together with the adjacency matrix to construct the Laplacian matrix of a graph.〔.〕 ==Definition== Given a graph $G=(V,E)$ with $|V|=n$ the degree matrix $D$ for $G$ is a $n\; \backslash times\; n$ diagonal matrix defined as〔 :$d\_:=\backslash left\backslash \backslash \; i\; =\; j\; \backslash \backslash$ 0 & \mbox \end \right. where the degree $\backslash deg(v\_i)$ of a vertex counts the number of times an edge terminates at that vertex. In an undirected graph, this means that each new loop increases the degree of a vertex by two. In a directed graph, the term ''degree'' may refer either to indegree (the number of incoming edges at each vertex) or outdegree (the number of outgoing edges at each vertex). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Degree matrix」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.